package ex1;


public class AllDefsCoverageCases extends EdgeCoverageCases{

	// TR:
	// Du(0, numbers) --> Covered in T2 [(2,7)]
	// Du(1, count)	  --> Covered in T2 [(2,7)]
	// Du(2, i)       --> Covered in T2 [(2,2)]
	// Du(3,x)		  --> Can't be covered, since it's only used in 3 which must lead to a loop to 2 
	// Du(6, count)   --> Can't be covered, since it's only used in 3 which must lead to a loop to 2
	
	
	// Basically the problem is that you can't get inside the for loop once:
	// Either you get in, then you must get out from Node 2 --> Loop,
	// If you want to get out from Node 5, you must see in numbers[i-1] = -1, which means, you made a loop.

}
